Anonymous Query Processing in Road Networks
نویسندگان
چکیده
منابع مشابه
Anonymous Processing of Query in Road Networks
The increasing availability of location-aware mobile devices has given rise to a flurry of location-based services (LBS). Due to the nature of spatial queries, an LBS needs the user position in order to process her requests. On the other hand, revealing exact user locations to a (potentially untrusted) LBS may pinpoint their identities and breach their privacy. To address this issue, spatial an...
متن کاملLocation-based Query Processing on Moving Objects in Road Networks∗
Location-based services are increasingly popular. In this paper, we present our novel design of a system to process location-based queries on MOVing objects in road Networks (MOVNet, for short) that efficiently handles a large number of spatial queries over moving objects in a stationary road network. MOVNet utilizes an on-disk R-tree to store the network connectivities and an in-memory grid in...
متن کاملEnhanced Network Based Query Processing in Road networks
The location aware portable devices are widely increased. This rise to the usage of location based services to reveal their own location and needed location. The existing query processing techniques uses the private information of the user. It threatens the user identity, privacy and confidentiality. To overcome this, instead of spatial region with one query reference point to process the query...
متن کاملWithin Skyline Query Processing in Dynamic Road Networks
The continuous within skyline query is an important type of location-based query, which can provide useful skyline object information for the user. Previous studies on processing the continuous within skyline query focus exclusively on a static road network, where the object attributes and the conditions of roads remain unchanged. However, in real-world applications, object attributes and road ...
متن کاملParallelized Proximity-Based Query Processing Methods for Road Networks
In this paper, we propose a paradigm for processing in parallel graph joins in road networks. The methodology we present can be used for distance join processing among the elements of two disjoint sets R,S of nodes from the road network, with R ≺ S, and we are in search for the pairs of vertices (u,v), where u ∈ R and v ∈ S, such that dist(u,v) ≤ θ . Another variation of the problem would invol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2010
ISSN: 1041-4347
DOI: 10.1109/tkde.2009.48